منابع مشابه
Constant time parallel sorting: an empirical view
Consider the following problem: If you want to sort n numbers in k (a constant) rounds then how many comparisons-per-round do you need? This problem has been studied carefully and there exist several algorithms and some lower bounds for it. Many of the algorithms are non-constructive. We have embarked on an empirical study of most of the algorithms in the literature, including the non-construct...
متن کاملA Survey of Constant Time Parallel Sorting
This has been quite an exciting summer for computational complexity. The 15th Conference on Computational Complexity held July 4-7 in Florence was a great success. We had many interesting talks and a wonderful invited talks and tutorials by Paul Beame, Luca Trevisan and Russell Impagliazzo. Preparations are underway for the 16th Conference next summer in Chicago. The Institute of Advanced Studi...
متن کاملA Survey of Constant Time Parallel Sorting (Preliminary Version)
It is well known that sorting can be done with O(n log n) comparisons. It is also known that (in the comparison decision tree model) sorting requires Ω(n log n) comparisons. What happens if you allow massive parallelism? In the extreme case you can sort n elements in one round by using (n 2 ) processors to make all the comparisons at once. It is easy to show that sorting in one round requires (...
متن کاملA constant-time parallel sorting algorithm and its optical implementation
Sorting is a fundamental operation that has important implications in a vast number of areas. For instance, sorting is heavily utilized in applications such as database machines, where hashing techniques are used to accelerate data processing algorithms. It is also the basis for interprocessor message routing and has strong implications in video telecommunications. However, high-speed electroni...
متن کاملA Constant Approximation Algorithm for Sorting Buffers
We consider an algorithmic problem that arises in manufacturing applications. The input is a sequence of objects of various types. The scheduler is fed the objects in the sequence one by one, and is equipped with a finite buffer. The goal of the scheduler/sorter is to maximally reduce the number of type transitions. We give the first polynomial-time constant approximation algorithm for this pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2014
ISSN: 0890-5401
DOI: 10.1016/j.ic.2014.01.017